Scheduling hard real-time systems: a review

Scheduling hard real-time systems: a review

Real-time calculus for scheduling hard real-time systems

This paper establishes a link between three areas, namely Max-Plus Linear System Theory as used for dealing with certain classes of discrete event systems, Network Calculus for establishing time bounds in communication networks, and real-time scheduling. In particular, it is shown that important results from scheduling theory can be easily derived and unified using Max-Plus Algebra. Based on th...

Real-Time scheduling: from hard to soft real-time systems

Real-time systems are traditionally classified into hard real-time and soft real-time: in the first category we have safety critical real-time systems where missing a deadline can have catastrophic consequences, whereas in the second class we find systems for which we need to optimise the Quality of service provided to the user. However, the frontier between these two classes is thinner than on...

Scheduling with message deadlines for hard real time SDL systems

Hard real–time system design requires both, a methodology that allows to control the increasing functional complexity and additionally an a–priori proof that all timing requirements will be met even in worst case situations. This work introduces a design heuristics based on the formal " Specification and Description Language " SDL aiming on the integration of a timeliness verification into an a...

Scheduling Aperiodic and Sporadic Tasks in Hard Real - Time Systems

The stringent timing constraints as well as the functional correctness are essential requirements of hard real-time systems. In such systems, scheduling plays a very important role in satisfying these constraints. The priority based scheduling schemes have been used commonly due to the simplicity of the scheduling algorithm. However, in the presence of task interdependencies and complex timing ...